Coherence simplices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced Simplices

An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group Z/mZ. In this paper, we consider simplices appearing in the orbits generated from arithmetic arrays by additive cellular automata. We prove that they constitute a source of balanced simplices, that are simplices containing all the elements of Z/mZ with the same mult...

متن کامل

Marching Simplices

A multi-dimensional algorithm for surface extraction from a structured domain is presented. Topological information is used to split the n-cubes into simplices which are used to extract the possible configurations of new surface elements. The algorithm is intended to complement to the existing surface extraction algorithms, which are specialized to deal with a set dimension, while this algorith...

متن کامل

Quadratically Many Colorful Simplices

The colorful Carathéodory theorem asserts that if X1, X2, . . . , Xd+1 are sets in R, each containing the origin 0 in its convex hull, then exists a set S ⊆ X1 ∪ · · · ∪ Xd+1 with |S ∩ Xi| = 1 for all i = 1, 2, . . . , d + 1 and 0 ∈ conv(S) (we call conv(S) a colorful covering simplex). Deza, Huang, Stephen and Terlaky proved that if the Xi are in general position with respect to 0 (consequentl...

متن کامل

Containment and Inscribed Simplices

Let K and L be compact convex sets in Rn. The following two statements are shown to be equivalent: (i) For every polytope Q ⊆ K having at most n+ 1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 ≤ d ≤ n − 1. It is also shown that the following two statements are equivalent: (i) For every polytope Q ⊆ K having at most d+ 1 vertices, L contains a translate of Q. (i...

متن کامل

Empty Monochromatic Simplices

Let S be a k-colored (finite) set of n points in R, d ≥ 3, in general position, that is, no (d+1) points of S lie in a common (d−1)-dimensional hyperplane. We count the number of empty monochromatic d-simplices determined by S, that is, simplices which have only points from one color class of S as vertices and no points of S in their interior. For 3 ≤ k ≤ d we provide a lower bound of Ω(nd−k+1+...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: New Journal of Physics

سال: 2012

ISSN: 1367-2630

DOI: 10.1088/1367-2630/14/11/113015